A Note on the Probabilistic Analysis of Patricia Trees
نویسنده
چکیده
We consider random patricia trees constructed from n i.i.d. sequences of independent equiprobable bits. We study the height Hn (the maximal distance between the root and a leaf), and the minimal fill-up level Fn (the minimum distance between the root and a leaf). We give probabilistic proofs of Hn − log2 n √ 2 log2 n → 1 almost surely and Fn − log2 n log2 logn → −1 almost surely.
منابع مشابه
Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth
Suffix trees are the most frequently used data structures in algorithms on words. In this paper, we consider the depth of a compact suffix tree, also known as the PAT tree, under some simple probabilistic assumptions. For a biased memoryless source, we prove that the limiting distribution for the depth in a PAT tree is the same as the limiting distribution for the depth in a PATRICIA trie, even...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملA NOTE ON THE EQUISEPARABLE TREES
Let T be a tree and n_{l}(eIT) and n_{2}(eIT) denote the number of vertices of T, lying on the two sides of the edge e. Suppose T_{l} and T_{2} are two trees with equal number of vertices, e in T_{1} and f in T_{2}. The edges e and f are said to be equiseparable if either n_{l}(eIT_{I}) = n_{l}(fIT_{2}) or n_{l}(eIT_{I}) = n_{2}(fIT_{2}). If there is an one-to-one correspondence between the ver...
متن کاملSome properties of continuous linear operators in topological vector PN-spaces
The notion of a probabilistic metric space corresponds to thesituations when we do not know exactly the distance. Probabilistic Metric space was introduced by Karl Menger. Alsina, Schweizer and Sklar gave a general definition of probabilistic normed space based on the definition of Menger [1]. In this note we study the PN spaces which are topological vector spaces and the open mapping an...
متن کاملProject: Probabilistic Analysis of Random Digital Trees
This is the final report on the National Science Council project “Probabilistic Analysis of Random Digital Trees” with grant number NSC-99-2115-M-009-007-MY2. We first summarize the main achievements of the project. • We applied our approach from the project proposal to various cost measures in random symmetric digital search trees (see [7]). • We applied our approach to partial match retrieval...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 3 شماره
صفحات -
تاریخ انتشار 1992